Speeding up Genetic Programming
نویسندگان
چکیده
One of the major drawbacks of Evolutionary Computation is the need for great computational power. The set of problems that can be solved, in practice, by evolutionary approaches is highly connected with the efficiency of the algorithm. In most Genetic Programming applications the majority of time is spent on the evaluation of the individuals. Accordingly, it is desirable to optimise this step of the process. In this paper we present two approaches through which significant speed improvements can be achieved. The first approach, T-functions, is effective in tasks, such as symbolic regression, that require repeated evaluation of the individuals. The second approach, caching, resorts to the storage of the execution results of individuals’ sub-trees, thus avoiding the recalculation of these sub-programs. Caching finds its application when the function set includes complex, time-consuming functions.
منابع مشابه
Causality in Genetic Programming
Causality relates changes in the structure of an object with the eeects of such changes, that is changes in the properties or behavior of the object. This paper analyzes the concept of causality in Genetic Programming (GP) and suggests how it can be used in adapting control parameters for speeding up GP search. We rst analyze the eeects of crossover to show the weak causality of the GP represen...
متن کاملIncremental Evolution in Genetic Programming
This paper presents a study of different methods of using incremental evolution with genetic programming. Incremental evolution begins with a population already trained for a simpler but related task. No other systematic study of this method seems to be available. Experimental evidence shows the technique provides a dependable means of speeding up the solution of complex problems with genetic p...
متن کاملSpeeding Up Evolutionary Learning Algorithms using GPUs
This paper propose a multithreaded Genetic Programming classification evaluation model using NVIDIA CUDA GPUs to reduce the computational time due to the poor performance in large problems. Two different classification algorithms are benchmarked using UCI Machine Learning data sets. Experimental results compare the performance using single and multithreaded Java, C and GPU code and show the eff...
متن کاملSpeeding up Genetic Programming: A Parallel BSP implementation
A parallel implementation of Genetic Programming is described, using the Bulk Synchronous Parallel Programming (BSP) model, as implemented by the Oxford BSP library. It is shown that considerable speedup of the GP execution can be achieved. As the complexity and the size of the problem increases, the actual speedup can be improved (assuming a constant number of processors), since the communicat...
متن کاملSpeeding Up Inference in Statistical Relational Learning by Clustering Similar Query Literals
Markov logic networks (MLNs) have been successfully applied to several challenging problems by taking a “programming language” approach where a set of formulas is hand-coded and weights are learned from data. Because inference plays an important role in this process, “programming” with an MLN would be significantly facilitated by speeding up inference. We present a new meta-inference algorithm ...
متن کاملSpeeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology
We extend the algorithm of Galil and Giancarlo, which speeds up dynamic programming in the case of concave cost functions, such that a compact representation of all optimal solutions is computed. Compared to the Galil-Giancarlo algorithm our time bound grows only by a small constant factor. With a compact representation, we develop eecient algorithms for the solution of problems in molecular bi...
متن کامل